package com.algorithms.absdatatypes;

public interface MinPriorityQueue<K extends Comparable,T>
{
	public void insert(Node<K,T> node);

	public Node<K,T> minimum();

	public Node<K,T> extractMin();

	public void decreaseKey(Node<K,T> from, Node<K,T> to);
	
	public boolean isEmpty();
	
	public Node<K,T> findKey(K node);
}
